Topologies on Free Monoids Induced by Families of Languages
نویسنده
چکیده
For i f c^> (£*) the language operator Anf^ (A) is defined by {z\ z\A e^}. Itwas characterized what families JSf correspond to ciosure operators. In this paper the families Z£ are found out corresponding to interior operators: they are filters with a special property. For the case of principal filters <£= {A\A=IL} such a family is obtained iff L is a monoid. Thus from euery monoid a topology can be constructed. Further results are given. Resumé. — Étant donné une classe de langages J?, on définit un opérateur sur les langages Anf^(y4)= {z\z\AeJ?}. On connaissait déjà les familles S? correspondant à des opérateurs de fermeture. Dans cet article on décrit les familles $£ correspondant à des opérateurs d'ouverture : ce sont des filtres avec une propriété caractéristique. Pour le cas de filtres principaux J£f — {/4 | /4^L} cette propriété caractéristique est que L soit un monotde. Par conséquent on peut construire une topologie pour chaque monoïde L. D'autres résultats sont formulés dans Varticle.
منابع مشابه
Some Operators on Families of Fuzzy Languages and Their Monoids
We study the structure of partially ordered monoids generated by certain operators on families of fuzzy languages. These operators are induced by simple, well-known operations on fuzzy languages, like fuzzy homomorphism, fuzzy finite substitution and intersection with regular fuzzy languages. The structure of these monoids provides better insight in the (in)dependency of closure properties of s...
متن کاملOn Recognizable Languages in Divisibility Monoids
Kleene’s theorem on recognizable languages in free monoids is considered to be of eminent importance in theoretical computer science. It has been generalized into various directions, including trace and rational monoids. Here, we investigate divisibility monoids which are defined by and capture algebraic properties sufficient to obtain a characterization of the recognizable languages by certain...
متن کاملProducts of Languages with Counter
It is well known that varieties of rational languages are in one-to-one correspondence with varieties of finite monoids. This correspondence ofte., extends to operations on languages and on monoidc. We investigate the special case of the product of languages with counter, and describe the associated operations on monoids and varieties. R&emi. On sait que les varietes de IangagEs rationnels sont...
متن کاملWalking automata in the free inverse monoid
In this paper, we study languages of birooted trees or, following Scheiblich-Munn’s theorem, subsets of free inverse monoids. Extending the classical notion of rational languages with a projection operator that maps every set of birooted trees to the subset of its idempotent elements it is first shown that the hierarchy induced by the nesting depth of that projection operator simply correspond ...
متن کاملTree Algebras
Many important families of regular languages have effective characterizations in terms of syntactic monoids or syntactic semigroups (see e.g. [1]). Definition of the syntactic monoid (resp. syntactic semigroup) of a language L ⊆ X * (resp. a language L ⊆ X +) over an alphabet X requires regarding L as a subset of the free monoid X * (resp. free semigroup X +). On the other hand tree languages h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- ITA
دوره 17 شماره
صفحات -
تاریخ انتشار 1983